Coupling on weighted branching trees
نویسندگان
چکیده
This paper considers linear functions constructed on two different weighted branching processes and provides explicit bounds for their Kantorovich-Rubinstein distance in terms of couplings of their corresponding generic branching vectors. Motivated by applications to the analysis of random graphs, we also consider a variation of the weighted branching process where the generic branching vector has a different dependence structure from the usual one. By applying the bounds to sequences of weighted branching processes, we derive sufficient conditions for the convergence in the Kantorovich-Rubinstein distance of linear functions. We focus on the case where the limits are endogenous fixed points of suitable smoothing transformations.
منابع مشابه
Characterizing weighted MSO for trees by branching transitive closure logics
We introduce the branching transitive closure operator on weighted monadic second-order logic formulas where the branching corresponds in a natural way to the branching inherent in trees. For arbitrary commutative semirings, we prove that weighted monadic second order logics on trees is equivalent to the definability by formulas which start with one of the following operators: (i) a branching t...
متن کاملMaximums on Trees
We study the minimal/endogenous solution R to the maximum recursion on weighted branching trees given by
متن کاملTight Bounds using Hankel Matrix for Arithmetic Circuits with Unique Parse Trees
This paper studies lower bounds for arithmetic circuits computing (non-commutative) polynomials. Our conceptual contribution is an exact correspondence between circuits and weighted automata: algebraic branching programs are captured by weighted automata over words, and circuits with unique parse trees by weighted automata over trees. The key notion for understanding the minimisation question o...
متن کاملOn trees and the multiplicative sum Zagreb index
For a graph $G$ with edge set $E(G)$, the multiplicative sum Zagreb index of $G$ is defined as$Pi^*(G)=Pi_{uvin E(G)}[d_G(u)+d_G(v)]$, where $d_G(v)$ is the degree of vertex $v$ in $G$.In this paper, we first introduce some graph transformations that decreasethis index. In application, we identify the fourteen class of trees, with the first through fourteenth smallest multiplicative sum Zagreb ...
متن کاملOn the reliability wiener number
One of the generalizations of the Wiener number to weighted graphs is to assign probabilities to edges, meaning that in nonstatic conditions the edge is present only with some probability. The Reliability Wiener number is defined as the sum of reliabilities among pairs of vertices, where the reliability of a pair is the reliability of the most reliable path. Closed expressions are derived for t...
متن کامل